MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
نویسندگان
چکیده
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that λ-precision graphs are planar for λ > 1/ √ 2 and give a dichotomy theorem for max-cut computational complexity on λ-precision unit disk graphs.
منابع مشابه
MAT 585: Max-Cut and Stochastic Block Model
Today we discuss two NP-hard problems, Max-Cut and minimum bisection. As these problems are NP-hard, unless the widely believed P 6= NP conjecture is false, these problem cannot be solved in polynomial time for every instance. These leaves us with a couple of alternatives: either we look for algorithms that approximate the solution, or consider algorithms that work for “typical” instances, but ...
متن کاملMinimum Bisection Is NP-hard on Unit Disk Graphs
In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.
متن کاملFurther Information on Publisher's Website: Httpxggdxfdoiforggihfihhugwuveqettperrrtsev 2 2 Use Policy Minimum Bisection Is Np-hard on Unit Disk Graphs
In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.
متن کاملAn exact algorithm for MAX-CUT in sparse graphs (Preliminary version)1
The MAX-CUT problem consists in partitioning the vertex set of a weighted graph into two subsets. The objective is to maximize the sum of weights of those edges that have their endpoints in two different parts of the partition. MAX-CUT is a well known NP-hard problem and it remains NP-hard even if restricted to the class of graphs with bounded maximum degree ∆ (for ∆ ≥ 3). In this paper we stud...
متن کاملApproximation Complexity of Max-Cut on Power Law Graphs
In this paper we study the MAX-CUT problem on power law graphs (PLGs) with power law exponent β. We prove some new approximability results on that problem. In particular we show that there exist polynomial time approximation schemes (PTAS) for MAX-CUT on PLGs for the power law exponent β in the interval (0, 2). For β > 2 we show that for some ε > 0, MAX-CUT is NP-hard to approximate within appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 377 شماره
صفحات -
تاریخ انتشار 2007